Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
نویسندگان
چکیده
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For general m-edge and n-vertex graphs, it is well-known to be solvable in O(m √ n) time. We develop the first linear-time algorithm to find maximumcardinality matchings on cocomparability graphs, a prominent subclass of perfect graphs that contains interval graphs as well as permutation graphs. Our algorithm is based on the recently discovered Lexicographic Depth First Search (LDFS).
منابع مشابه
Fine-Grained Algorithm Design for Matchin
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For m-edge and n-vertex graphs, it is well-known to be solvable in O(m √ n) time; however, for several applications this running time is still too slow. Improving this worst-case upper bound resisted decades of research. In this paper we mainly focus on parameterizations of the input w...
متن کاملMaximum Induced Matching Algorithms via Vertex Ordering Characterizations
We study the maximum induced matching problem on a graph G. Induced matchings correspond to independent sets in L2(G), the square of the line graph of G. The problem is NP-complete on bipartite graphs. In this work, we show that for a number of graph families with forbidden vertex orderings, almost all forbidden patterns on three vertices are preserved when taking the square of the line graph. ...
متن کاملUniquely Restricted Matchings in Interval Graphs
A matching M in a graph G is said to be uniquely restricted if there is no other matching in G that matches the same set of vertices as M . We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted matching in an interval graph, thereby answering a question of Golumbic et al. (“Uniquely restricted matchings”, M. C. Golumbic, T. Hirst and M. Lewenstein, Algorit...
متن کاملLinear Time LexDFS on Cocomparability Graphs
Lexicographic depth first search (LexDFS) is a graph search protocol which has already proved to be a powerful tool on cocomparability graphs, a subfamily of perfect graphs. Cocomparability graphs have been well studied through their complements (comparability graphs) and their corresponding posets. Recently however LexDFS has led to a number of elegant near linear time algorithms on cocomparab...
متن کاملMatchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchings, where a matching is k-maximal if it admits no augmenting path with ≤ 2k vertices. The second involves finding a maximal set of vertices that is matchable — comprising one side of the edges in some matching. Among ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1703.05598 شماره
صفحات -
تاریخ انتشار 2017